Secondly,presents a new efficient 2D task placement scheme with a time complexity O(b(N_t-b/4)) of the task allocation,which is better than existing O(bN_t) or O(N_t~2) placement scheme.
第二,对可重构系统中的二维任务放置算法进行了分析研究,提出了一种新的平均任务分配时间复杂度为O(b(N_t-b/4))的二维任务放置策略,它优于现有的时间复杂度为O(bN_t)或者O(n_t~2)的放置算法。
参考来源 - 支持可重构计算的Linux操作系统研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Finally, the optimal placement scheme of sensors was presented according to a real arch modal experiment.
最后结合拱结构模态试验，提出了传感器优化布置方案。
Now there are more and more researches on the data placement scheme based on multi-erasure correcting codes such as HDD1, HDD2.
对基于多容错编码的数据布局的研究受到了广泛的关注，并且出现了一些三容错的布局算法，如HDD1，HDD2等。
The data placement scheme based on single-erasure correcting codes can not satisfy the requirement of storage system on reliability.
基于单容错编码的数据布局已经不能满足存储系统对可靠性越来越高的要求。
应用推荐